On combinatorial properties of elementary intramolecular operations
نویسنده
چکیده
Here we tackle a problem from biology in terms of discrete mathematics. We are interested in a complex DNA manipulation process happening in eukaryotic organisms of a subclass of ciliate species called Stichotrichia during so-called gene assembly. This process is in particular interesting since one can interpret gene assembly in ciliates as sorting of permutations. We survey here results related to studies on sorting permutations with some specific rewriting rules that formalize elementary intramolecular gene assembly operations. The research question is “what permutation may be sorted with our operations?”
منابع مشابه
TRIANGULAR FUZZY MATRICES
In this paper, some elementary operations on triangular fuzzynumbers (TFNs) are defined. We also define some operations on triangularfuzzy matrices (TFMs) such as trace and triangular fuzzy determinant(TFD). Using elementary operations, some important properties of TFMs arepresented. The concept of adjoints on TFM is discussed and some of theirproperties are. Some special types of TFMs (e.g. pu...
متن کاملElementary properties of circle map sequences
We study the combinatorial and structural properties of the circle map sequences. We introduce an embedding procedure which gives a map Φ : Ω → W := {R,L} from the hull(closure of the set of translates) to the sequence of embedding operations through which we study the structure of Ω. We also study the set of admissible words and classify them in terms of their appearance. Mathematics Subject C...
متن کاملGlobal Actions, Groupoid Atlases and Applications
Global actions were introduced by A. Bak to give a combinatorial approach to higher K-theory, in which control is kept of the elementary operations through paths and paths of paths. This paper is intended as an introduction to this circle of ideas, including the homotopy theory of global actions, which one obtains naturally from the notion of path of elementary operations. Emphasis is placed on...
متن کاملSpeeding up the Four Russians Algorithm by About One More Logarithmic Factor
We present a new combinatorial algorithm for Boolean matrix multiplication that runs in O(n(log log n)/ log n) time. This improves the previous combinatorial algorithm by Bansal and Williams [FOCS’09] that runs in O(n(log log n)/ log n) time. Whereas Bansal and Williams’ algorithm uses regularity lemmas for graphs, the new algorithm is simple and uses entirely elementary techniques: table looku...
متن کاملThe Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 22 شماره
صفحات -
تاریخ انتشار 2014